Applications and Optimizations for LTL Synthesis
نویسنده
چکیده
LTL synthesis is the process of generating a reactive finite-state system from a formal specification written in Linear Temporal Logic (LTL). The idea of synthesis is to automatically construct a functional correct system from a behavioral description of the system. Even though the idea is nearly fifty years old and the underlying theory is well established, is has not be adapted to practice yet. The main reasons are the high complexity of the problem and intrinsic algorithms. This thesis follows along three different paths to bring LTL synthesis closer to practice. First, we present our synthesis tool Lily, a Linear Logic Synthesizer. Lily is the first implementation of a synthesis tool for full LTL. It is based on a recent approach to synthesis by Kupferman and Vardi that goes through a variety of alternating tree automata. Lily implements this approach and a set of optimizations necessary to make the approach applicable. Lily can only handle small examples, but since it imposes no restriction on the syntax of the LTL formula, it is easy to use and can help users to get familiar with LTL. In the second part, we state the repair problem and solve it for finite-state systems using synthesis techniques. In the repair problem, given a specification and faulty system, we search for slightly modifications of the system that make it correct with respect to the specification. We consider the repair problem as a game, which consists of a modified version of the faulty system and an automaton representing the specification. Every winning strategy of the game corresponds to a repair. However, a strategy with memory results in a repair that adds variables to the program, which we argue is undesirable. In order to avoid extra variables, we need a memoryless strategy. We show that the problem of finding a memoryless strategy is NP-complete and present a heuristic to compute such strategies. We have implemented the approach symbolically and present initial experimental results to show its usefulness. Finally, in the third part of the thesis we focus on the main application of synthesis:
منابع مشابه
CS422 – Formal Methods in System Design: A Monitor Synthesis Algorithm for Past LTL
A monitor synthesis algorithm from linear temporal logic (LTL) safety formulae of the form φ where φ is a past time LTL formula was presented in [3]. The generated monitors implemented the recursive semantics of past-time LTL using a dynamic programming technique, and needed O(|φ|) time to process each new event and O(|φ|) total space. Some compiler-like optimizations of the generated monitors ...
متن کاملACTL ∩ LTL Synthesis
We study the synthesis problem for specifications of the common fragment of ACTL (computation tree logic with only universal path quantification) and LTL (linear-time temporal logic). Key to this setting is a novel construction for translating properties from LTL to very-weak automata, whenever possible. Such automata are structurally simple and thus amenable to optimizations as well as symboli...
متن کاملFinite LTL Synthesis is EXPTIME-complete
LTL synthesis – the construction of a function to satisfy a logical specification formulated in Linear Temporal Logic – is a 2EXPTIME-complete problem with relevant applications in controller synthesis and a myriad of artificial intelligence applications. In this research note we consider De Giacomo and Vardi’s variant of the synthesis problem for LTL formulas interpreted over finite rather tha...
متن کاملA LTL Fragment for GR(1)-Synthesis
The idea of automatic synthesis of reactive programs starting from temporal logic (LTL) specifications is quite old, but was commonly thought to be infeasible due to the known double exponential complexity of the problem. However, new ideas have recently renewed the interest in LTL synthesis: One major new contribution in this area is the recent work of Piterman et al. who showed how polynomial...
متن کاملIndex Appearance Record for Transforming Rabin Automata into Parity Automata
Transforming deterministic ω-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008